Waiting-time approximations for multiple-server polling systems
نویسندگان
چکیده
منابع مشابه
Closed-Form Waiting Time Approximations for Polling Systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes...
متن کاملWaiting Time Variance in Polling Systems
In this paper, we develop a general expression for the second moment of waiting time for polling systems with either an exhaustive or gated service policy. We obtain a closed form expression for the second moment of waiting time for the special case of systems with two identical stations. This result is used to show that the behavior of the first two moments can be very different. Specifically,...
متن کاملA new method for deriving waiting-time approximations in polling systems with renewal arrivals
We study the waiting-time distributions in cyclic polling models with renewal arrivals, general service and switch-over times, and exhaustive service at each of the queues. The assumption of renewal arrivals prohibits an exact analysis and reduces the available analytic results to heavy-traffic asymptotics, limiting results for large switch-over times and large numbers of queues, and some numer...
متن کاملExpected waiting time in symmetric polling systems with correlated vacations
Polling systems have been extensively studied, and have had many applications. They have often been used for studying wired local areas networks (such as token passing rings) and wireless local area networks (such as bluetooth). In this work we relax one of the main restrictions on the statistical assumptions under which polling systems have been analyzed. Namely, we allow correlation between w...
متن کاملServer waiting times in infinite supply polling systems with preparation times
We consider a system consisting of a single server serving a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queueing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. For the case w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 1998
ISSN: 0166-5316
DOI: 10.1016/s0166-5316(96)00063-6